A Combination Algorithm of Multiple Lattice-Valued Concept Lattices

A Combination Algorithm of Multiple Lattice-Valued Concept Lattices

With the rapid development of network technology, especially in the internet area, distributed computation and parallel processing of data are urgently needed. This paper studies the combination operation of the lattice-valued concept lattices to realize its distributed computation and parallel processing. The proposal of its corresponding combination algorithm is mainly according to the conjun...

LATTICE-VALUED CATEGORIES OF LATTICE-VALUED CONVERGENCE SPACES

We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...

A Parameterized Algorithm for Exploring Concept Lattices

Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (respectively negative examples) are sets of frequent concepts with respect to a minimal support, whose extent contains only positive examples (respectively negative examples). In terms of association rules, the above ...

Concept Lattice algorithm implementation

The increasing interest on application of concept lattices in the different information systems results in several implementations and algorithm proposals and representation tools. The concept lattice is mainly for representation of the concept generalization structure but it can apply as a classification tool too. A key component of practical applications is the efficient implementation of lat...

Many-Valued Concept Lattices for Conceptual Clustering and Information Retrieval